A Majorization-Minimization Algorithm for Nonnegative Binary Matrix Factorization

نویسندگان

چکیده

This paper tackles the problem of decomposing binary data using matrix factorization. We consider family mean-parametrized Bernoulli models, a class generative models that are well suited for modeling and enables interpretability factors. factorize parameter an additional Beta prior on one factors to further improve model's expressive power. While similar have been proposed in literature, they only exploit as proxy ensure valid Bayesian setting; practice it reduces uniform or uninformative prior. Besides, estimation these has focused costly inference. In this paper, we propose simple yet very efficient majorization-minimization algorithm maximum posteriori estimation. Our approach leverages whose parameters can be tuned performance completion tasks. Experiments conducted three public datasets show our offers excellent trade-off between prediction performance, computational complexity, interpretability.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Nonnegative Matrix Factorization via Alternating Minimization

In this paper we consider the Nonnegative Matrix Factorization (NMF) problem: given an (elementwise) nonnegative matrix V ∈ R + find, for assigned k, nonnegative matrices W ∈ R + and H ∈ R k×n + such that V = WH . Exact, non trivial, nonnegative factorizations do not always exist, hence it is interesting to pose the approximate NMF problem. The criterion which is commonly employed is I-divergen...

متن کامل

Additive Update Algorithm for Nonnegative Matrix Factorization

Abstract—Nonnegative matrix factorization (NMF) is an emerging technique with a wide spectrum of potential applications in data analysis. Mathematically, NMF can be formulated as a minimization problem with nonnegative constraints. This problem is currently attracting much attention from researchers for theoretical reasons and for potential applications. Currently, the most popular approach to ...

متن کامل

Nonnegative/binary matrix factorization with a D-Wave quantum annealer

D-Wave quantum annealers represent a novel computational architecture and have attracted significant interest [1, 2, 3], but have been used for few real-world computations. Machine learning has been identified as an area where quantum annealing may be useful [4, 5, 6]. Here, we show that the D-Wave 2X can be effectively used as part of an unsupervised machine learning method. This method can be...

متن کامل

A Convergent Algorithm for Bi-orthogonal Nonnegative Matrix Tri-Factorization

Abstract. We extend our previous work on a convergent algorithm for uni-orthogonal nonnegative matrix factorization (UNMF) to the case where the data matrix is decomposed into three factors with two of them are constrained orthogonally and the third one is used to absorb the approximation error. Due to the way the factorization is performed, we name it as bi-orthogonal nonnegative matrix tri-fa...

متن کامل

A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem.  At each step of ALS algorithms two convex least square problems should be solved, which causes high com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Signal Processing Letters

سال: 2022

ISSN: ['1558-2361', '1070-9908']

DOI: https://doi.org/10.1109/lsp.2022.3187368